Formal SOS-Proofs for the Lambda-Calculus
نویسندگان
چکیده
We describe in this paper formalisations for the properties of weakening, type-substitutivity, subject-reduction and termination of the usual big-step evaluation relation. Our language is the lambda-calculus whose simplicity allows us to show actual theorem-prover code of the formal proofs. The formalisations are done in Nominal Isabelle, a definitional extention of the theorem prover Isabelle/HOL. The point of these formalisations is to be as close as possible to the “pencil-and-paper” proofs for these properties, but of course be completely rigorous. We describe where Nominal Isabelle is of great help with such formalisations and where one has to invest additional effort in order to obtain formal proofs.
منابع مشابه
A Coinductive Approach to Proof Search through Typed Lambda-Calculi
In reductive proof search, proofs are naturally generalized by solutions, comprising all (possibly infinite) structures generated by locally correct, bottom-up application of inference rules. We propose a rather natural extension of the Curry-Howard paradigm of representation, from proofs to solutions: to represent solutions by (possibly infinite) terms of the coinductive variant of the typed l...
متن کاملNormalization by Evaluation
This article formalizes normalization by evaluation as implemented in Isabelle. Lambda calculus plus term rewriting is compiled into a functional program with pattern matching. It is proved that the result of a successful evaluation is a) correct, i.e. equivalent to the input, and b) in normal form. An earlier version of this theory is described in a paper by Aehlig et al. [1]. The normal form ...
متن کاملUsing Vampire in Soundness Proofs of Type Systems
Type systems for programming languages shall detect type errors in programs before runtime. To ensure that a type system meets this requirement, its soundness must be formally verified. We aim at automating soundness proofs of type systems to facilitate the development of sound type systems for domain-specific languages. Soundness proofs for type systems typically require induction. However, ma...
متن کاملNominal SOS
Plotkin’s style of Structural Operational Semantics (SOS) has become a de facto standard in giving operational semantics to formalisms and process calculi. In many such formalisms and calculi, the concepts of names, variables and binders are essential ingredients. In this paper, we propose a formal framework for dealing with names in SOS. The framework is based on the Nominal Logic of Gabbay an...
متن کاملFormalization of Recursive Path Orders for Lambda-Free Higher-Order Terms
This Isabelle/HOL formalization de nes recursive path orders (RPOs) for higher-order terms without λ-abstraction and proves many useful properties about them. The main order fully coincides with the standard RPO on rst-order terms also in the presence of currying, distinguishing it from previous work. An optimized variant is formalized as well. It appears promising as the basis of a higher-orde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 247 شماره
صفحات -
تاریخ انتشار 2009